Differential Private POI Queries via Johnson-Lindenstrauss Transform
نویسندگان
چکیده
منابع مشابه
Privacy via the Johnson-Lindenstrauss Transform
In recent years, there has been an abundance of rich and fine-grained data about individuals in domains such as healthcare, finance, retail, web search, and social networks. It is desirable for data collectors to enable third parties to perform complex data mining applications over such data. However, privacy is a natural obstacle that arises when sharing data about individuals with third parti...
متن کاملThe Fast Johnson-lindenstrauss Transform
While we omit the proof, we remark that it is constructive. Specifically, A is a linear map consisting of random projections onto subspaces of Rd. These projections can be computed by n matrix multiplications, which take time O(nkd). This is fast enough to make the Johnson-Lindenstrauss transform (JLT) a practical and widespread algorithm for dimensionality reduction, which in turn motivates th...
متن کاملA Sparser Johnson-Lindenstrauss Transform
We give a Johnson-Lindenstrauss transform with column sparsity s = Θ(ε−1 log(1/δ)) into optimal dimension k = O(ε−2 log(1/δ)) to achieve distortion 1±ε with success probability 1−δ. This is the first distribution to provide an asymptotic improvement over the Θ(k) sparsity bound for all values of ε, δ. Previous work of [Dasgupta-Kumar-Sarlós, STOC 2010] gave a distribution with s = Õ(ε−1 log(1/δ...
متن کاملThe Johnson-Lindenstrauss Transform: An Empirical Study
The Johnson-Lindenstrauss Lemma states that a set of n points may be embedded in a space of dimension O(logn/ε2) while preserving all pairwise distances within a factor of (1+ ε) with high probability. It has inspired a number of proofs that extend the result, simplify it, and improve the efficiency of computing the resulting embedding. The lemma is a critical tool in the realm of dimensionalit...
متن کاملA Derandomized Sparse Johnson-Lindenstrauss Transform
Recent work of [Dasgupta-Kumar-Sarlós, STOC 2010] gave a sparse Johnson-Lindenstrauss transform and left as a main open question whether their construction could be efficiently derandomized. We answer their question affirmatively by giving an alternative proof of their result requiring only bounded independence hash functions. Furthermore, the sparsity bound obtained in our proof is improved. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2840726